Rapid Topology Design based on Shortest Path Betweenness for Virtual Network Construction
نویسندگان
چکیده
منابع مشابه
Virtual Network Construction with K-Shortest Path Algorithm and Prim’s MST Algorithm for Robust Physical Networks
Network virtualization has attracted considerable attention currently, and it has been expected to be utilized as new-generation network technology. For the network virtualization, improved network robustness is indispensable for virtual networks and a physical network. Moreover, it is important to utilize network resources in the physical network and construct a lot of virtual networks. In thi...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملVirtual Path Topology Design, Control and Optimization
An efficient virtual path (VP) control strategy is necessary in asynchronous transfer mode (ATM) networks to improve the utilization of network resources. Great advantages can be achieved by using the multistage VP control method, which is designed to execute the adjustment of VPs in three stages with specific tasks for each stage. In this paper, we first investigate the multistage VP control s...
متن کاملBiological and Shortest-Path Routing Procedures for Transportation Network Design
Background. The design of efficient transportation networks is an important challenge in many research areas. Among the most promising recent methods, biological routing mimic local rules found in nature. However comparisons with other methods are rare. Methods. In this paper we define a common framework to compare network design method. We use it to compare biological and a shortest-path routi...
متن کاملShortest-path network interdiction
We study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget. We formulate this bilevel, max–min problem as a mixed-integer program (MIP), which can be solved directly, but we develop more efficient decomposition a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IERI Procedia
سال: 2014
ISSN: 2212-6678
DOI: 10.1016/j.ieri.2014.09.098